منابع مشابه
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity
We present an explicit pseudorandom generator with seed length Õ((log n)w+1) for read-once, oblivious, width w branching programs that can read their input bits in any order. This improves upon the work of Impaggliazzo, Meka and Zuckerman (FOCS’12) where they required seed length n1/2+o(1). A central ingredient in our work is the following bound that we prove on the Fourier spectrum of branchin...
متن کاملStochastic Monotonicity and Realizable Monotonicity
We explore and relate two notions of monotonicity, stochastic and realizable, for a system of probability measures on a common finite partially ordered set (poset) S when the measures are indexed by another poset A. We give counterexamples to show that the two notions are not always equivalent, but for various large classes of S we also present conditions on the poset A that are necessary and s...
متن کاملOptimal Pruning for Unordered
Optimal Pruning for Unordered Search is a search algorithm that enables complete search through the space of possible disjuncts at the inner level of a covering algorithm. This algorithm takes as inputs an evaluation function, e, a training set, t, and a set of specialisation operators, o. It outputs a set of operators from o that creates a classifier that maximises e with respect to t. While O...
متن کاملUnordered Tuples in Quantum Computation
It is well known that the C∗-algebra of an ordered pair of qubits is M2⊗M2. What about unordered pairs? We show in detail that M3⊕C is the C∗-algebra of an unordered pair of qubits. Then we use Schur-Weyl duality to characterize the C∗-algebra of an unordered n-tuple of d-level quantum systems. Using some further elementary representation theory and number theory, we characterize the quantum cy...
متن کاملUnordered Constraint Satisfaction Games
We consider two-player constraint satisfaction games on systems of Boolean constraints, in which the players take turns in selecting one of the available variables and setting it to true or false, with the goal of maximising (for Player I) or minimising (for Player II) the number of satisfied constraints. Unlike in standard QBF-type variable assignment games, we impose no order in which the var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometrica
سال: 2018
ISSN: 0012-9682
DOI: 10.3982/ecta13777